Conjunctive normal form

Results: 92



#Item
21Mathematics / Automated theorem proving / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Conjunctive normal form / Unit propagation / Resolution / Theoretical computer science / Constraint programming / Applied mathematics

Resolution versus Search: Two Strategies for SAT  Irina Rish and Rina Dechter Information and Computer Science University of California, Irvine

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2000-11-01 13:42:40
22NP-complete problems / Automated theorem proving / Constraint programming / Boolean algebra / Formal methods / DPLL algorithm / Boolean satisfiability problem / Conjunctive normal form / Lookup table / Theoretical computer science / Applied mathematics / Mathematics

Combining Component Caching and Clause Learning for Effective Model Counting Tian Sang1 , Fahiem Bacchus2 , Paul Beame1 , Henry Kautz 1 , and Toniann Pitassi 2 1 Computer Science and Engineering, University of Washingto

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2004-04-13 00:26:28
23NP-complete problems / Conjunctive normal form / Combinatorics / Boolean satisfiability problem / String / Permutation / PP / 2-satisfiability / MAX-3SAT / Theoretical computer science / Mathematics / Computational complexity theory

Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 11 Satisfiability Coding Lemma ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2000-02-20 22:53:43
24Theoretical computer science / Resolution / Unit propagation / Conjunctive normal form / Literal / Backtracking / Inequality / Davis–Putnam algorithm / Automated theorem proving / Mathematics / Mathematical logic

Overview SAT Solving and its Relationship to CSPs ‫ ڗ‬Tremendous gains have been achieved over the

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2006-02-02 18:24:48
25Constraint programming / Constraint satisfaction problem / Constraint satisfaction / Exponential time hypothesis / Boolean satisfiability problem / NP-complete / Tree decomposition / Conjunctive normal form / Time complexity / Theoretical computer science / Applied mathematics / Computational complexity theory

Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2015-01-30 21:27:29
26Computational complexity theory / Conjunctive normal form / Proof complexity / PP / IP / Polynomial / Boolean algebra / Frege system / MAX-3SAT / Theoretical computer science / Applied mathematics / Logic in computer science

Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds∗ Yuval Filmus University of Toronto Massimo Lauria

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2013-05-06 19:14:13
27Logic / Logic in computer science / Propositional calculus / Rules of inference / Logic programming / Resolution / Conjunctive normal form / Unit propagation / Proof complexity / Theoretical computer science / Automated theorem proving / Mathematical logic

From Small Space to Small Width in Resolution Yuval Filmus1 , Massimo Lauria2 , Mladen Mikša2 , Jakob Nordström2 , and Marc Vinyals2 1 2

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-01-09 15:51:16
28Logical syntax / Automated theorem proving / Formal languages / Formal methods / Vampire / Resolution / Conjunctive normal form / E theorem prover / First-order logic / Logic / Mathematics / Mathematical logic

First-Order Theorem Proving and VAMPIRE? Laura Kov´acs1 and Andrei Voronkov2 1 Chalmers University of Technology 2

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2013-05-02 16:51:41
29Algorithm / Logic / Applied mathematics / Conjunctive normal form / Disjunctive normal form / Mathematics

Indexing Boolean Expressions Steven Euijong Whang, Hector Garcia-Molina Stanford University, Stanford, CA {swhang,hector}@cs.stanford.edu Chad Brower, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee,

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2009-07-27 10:29:02
30Rules of inference / Automated theorem proving / Predicate logic / Conjunctive normal form / Unification / Modus ponens / First-order logic / Function / Universal quantification / Logic / Mathematical logic / Mathematics

Artificial Intelligence Tutorial 3 - Answers 1a) Translate the following sentences into first order logic. (i) All dogs are mammals (ii) Fido is a dog (iii) Fido is a mammal (iv) All mammals produce milk

Add to Reading List

Source URL: ccg.doc.gold.ac.uk

Language: English - Date: 2013-09-18 10:16:32
UPDATE